Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
371	CALL FOR PAPERS for the 3rd workshop C ENTRAL E UROPEAN Q UANTUM I NFORMATION P ROCESSING Add to Reading List Source URL: www.quantenkryptographie.at Language: English - Date: 2008-02-20 11:11:56 QIP Quantum programming Quantum cryptography Quantum complexity theory Quantum information Michał Horodecki Quantum algorithm Theoretical computer science Quantum information science Applied mathematics
372	Geometric Complexity Theory III: On deciding nonvanishing of a Littlewood-Richardson coefficient Dedicated to Sri Ramakrishna Ketan D. Mulmuley ∗ The University of Chicago Hariharan Narayanan Add to Reading List Source URL: ramakrishnadas.cs.uchicago.edu Language: English - Date: 2012-04-03 17:03:42 Polynomials Computational complexity theory Algebraic combinatorics Representation theory Littlewood–Richardson rule Linear programming Time complexity P Algebraic geometry Mathematics Theoretical computer science Applied mathematics
373	LNBI[removed]On the Complexity of Several Haplotyping Problems Add to Reading List Source URL: homepages.cwi.nl Language: English - Date: 2008-01-17 14:27:10 Haplotype Matrix Dynamic programming Systems theory Systems science Science Classical genetics Genetic genealogy Population genetics
374	Algorithms for and the Complexity of Constraint Entailment by Zhendong Patrick Su B.A. (University of Texas at Austin[removed]B.S. (University of Texas at Austin) 1995 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2002-12-10 17:31:00 Computing Programming language theory Object-oriented programming Polymorphism Subtype polymorphism Entailment Type system E Constraint Type theory Software engineering Data types
375	Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Work of Daniel A. Spielman Gil Kalai Dan Spielman has made groundbreaking contributions in theoretical computer Add to Reading List Source URL: www.icm2010.org.in Language: English - Date: 2012-02-02 09:06:07 Computational complexity theory Analysis of algorithms Mathematical optimization Operations research Linear programming Smoothed analysis Daniel Spielman Simplex algorithm Algorithm Theoretical computer science Mathematics Applied mathematics
376	Annales Mathematicae et Informaticae[removed]pp. 29–44 http://ami.ektf.hu Complexity metric based source code transformation of Erlang programs∗ Add to Reading List Source URL: ami.ektf.hu Language: English - Date: 2013-12-20 14:03:26 Holism Computer programming Cyclomatic complexity Erlang Complexity Control flow Software quality Code refactoring Blum axioms Software metrics Software engineering Computing
377	A black box for online approximate pattern matching Rapha¨el Clifforda,∗, Klim Efremenkob , Benny Poratc , Ely Poratc a Department of Computer Science, University of Bristol,UK University, Dept. of Computer Science, 5 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 Dynamic programming Computational complexity theory Approximate string matching Pattern matching Time complexity Fast Fourier transform String searching algorithm Matching Knuth–Morris–Pratt algorithm Theoretical computer science Applied mathematics Mathematics
378	Pattern matching in pseudo real-time Rapha¨el Clifforda , Benjamin Sacha,∗ a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 String matching algorithms Computational complexity theory Donald Knuth Knuth–Morris–Pratt algorithm Time complexity String searching algorithm Matching Approximate string matching Levenshtein distance Theoretical computer science Applied mathematics Dynamic programming
379	A filtering algorithm for k-mismatch with don’t cares Rapha¨el Clifford1 and Ely Porat2 1 2 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Dynamic programming Computational complexity theory Analysis of algorithms String matching algorithms Approximate string matching Pattern matching String searching algorithm Time complexity Matching Theoretical computer science Applied mathematics Mathematics
380	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics